An Ordinal View of Independence with Application to Plausible Reasoning

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability theory, and the two others are based on the notion of conditional possibility. These two have enough expressive power to support the whole possibility theory, and a complete axiomatization is provided for the strongest one. Moreover we show that weak independence is well-suited to the problems of belief change and plausible reasoning, especially to address the problem of blocking of property inheritance in exception-tolerant taxonomic reasoning.Comment: Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994

Logique de programmeset sémantique intensionnelle

Audureau Eric, Farinas Del Cerro Luis. Logique de programmeset sémantique intensionnelle. In: Histoire Épistémologie Langage, tome 5, fascicule 2, 1983. La sémantique logique : Problèmes d'histoire et de méthode, sous la direction de Frédéric Nef. pp. 229-240

Notions de méréogéométrie (description qualitative de propriétés géométriques du mouvement et de la forme d'objets tridimensionnels)

TOULOUSE3-BU Sciences (315552104) / SudocSudocFranceF

Déduction automatique en calcul des durées basée sur la méthode des tableaux

TOULOUSE3-BU Sciences (315552104) / SudocLENS-CRIL (624982203) / SudocSudocFranceF

Tractability results in the block algebra

International audienceIn this paper we define the notion of a block algebra, which is based upon a spatial application of Allen's interval algebra. In the pddimensional Euclidean space, where p g 1, we consider only blocks whose sides are parallel to the axes of some orthogonal basis. The block algebra consists of a set of relations (the block relations) together with the fundamental operations of composition, converse and intersection. The 13 p basic relations of this algebra constitute the exhaustive list of the relations possibly holding between two blocks. We are interested in the problem of testing the consistency of a set of spatial constraints between blocks, i.e. a block network. The consistency question for block networks is NPdcomplete. We first extend the notions of convexity and preconvexity to the block algebra. Similarly to the interval algebra case, convexity leads to a tractable set whereas, contrary to the interval algebra case, preconvexity leads to an intractable set. Nevertheless we characterize a tractable subset of the preconvex relations: the strongly preconvex relations. Moreover we show that strong preconvexity and ORDdHorn representability are the same

Raisonnement qualitatif à propos des points de l'espace

National audienc

A model for reasoning about bidimensional temporal relations

International audienceThis paper introduces the rectangle algebra as the power set of the set of the pairs of atomic relations which can hold between two rational intervals. It goes on proving that the question of the consistency of a rectangle network which constraints are preconvex is decidable by means of the path-consistency method in time polynomial in the length of the network. 1 Introduction Temporal and spatial dependencies between data constitute the reason for existence of several problems in computer science : geographical information systems, natural language understanding, specification and verification of programs and systems, temporal and spatial databases, temporal and spatial planification, etc. Those who tackled these problems proposed numerous models for reasoning about time and space, the objects they considered as well as the relations between these objects distinguishing one of these models from the others. As an illustrative example, the model of the intervals proposed by Al..

A new tractable subclass of the rectangle algebra

International audienceThis paper presents the 169 permitted relations between two rectangles whose sides are parallel to the axes of some orthogonal basis in a 2-dimensional Euclidean space. Elaborating rectangle algebra just like interval algebra, it defines the concept of convexity as well as the ones of weak preconvexity and strong preconvexity. It introduces afterwards the fundamental operations of intersection, composition and inversion and demonstrates that the concept of weak preconvexity is preserved by the operation of composition whereas the concept of strong preconvexity is preserved by the operation of intersection. Finally, fitting the propagation techniques conceived to solve interval networks, it shows that the polynomial path-consistency algorithm is a decision method for the problem of proving the consistency of strongly preconvex rectangle networks

LoTREC: An environment for experiencing Kripke Semantics

International audienc